Probabilistic Verification of Structural Stability Design Procedures
نویسندگان
چکیده
منابع مشابه
Approximate and Probabilistic Computing : Design , Coding , Verification
Computing has entered the era of approximation, in which hardware and software generate and reason about estimates. Navigation applications turn maps and location estimates from hardware GPS sensors into driving directions; speech recognition turns an analog signal into a likely sentence; search turns queries into information; network protocols deliver unreliable messages; and recent advances p...
متن کاملDesign and formal verification of DZMBE+
In this paper, a new broadcast encryption scheme is presented based on threshold secret sharing and secure multiparty computation. This scheme is maintained to be dynamic in that a broadcaster can broadcast a message to any of the dynamic groups of users in the system and it is also fair in the sense that no cheater is able to gain an unfair advantage over other users. Another important feature...
متن کاملProbabilistic design: The future of rock engineering
A brief background to the development of the rock engineering design process is given, showing that since the development of the science of mathematics, deterministic methods have been used to perform various calculations. The variability of rock properties and support characteristics have always been known. However, they were not explicitly used in design but compensated for by the use of a sa...
متن کاملVerification of Probabilistic Programs
A general method for proving properties of probabilistic programs is presented, This method generalizes the intermediate assertion method in that it extends a given assertion on the output distribution into an invariant assertion on all intermediate distributions, too. The proof method is shown to be sound and complete for programs which terminate with probability 1. A dual approach, based on t...
متن کاملProbabilistic Verification of Proofs
Recent research in the theory of computing has led to the following intriguing result. “There exists a probabilistic verifier for proofs of mathematical assertions that looks at a proof in only a constant number of bit positions and satisfies the following properties: (Completeness) For every valid theorem there exists a proof that is always accepted. (Soundness) For invalid assertions every pu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Open Civil Engineering Journal
سال: 2018
ISSN: 1874-1495
DOI: 10.2174/1874149501812010283